TSTP Solution File: COM206^1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : COM206^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 10:28:24 EDT 2024
% Result : Theorem 39.73s 7.94s
% Output : Refutation 39.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 20 ( 19 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 137 ( 12 ~; 5 |; 3 &; 117 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 16 ( 0 ^ 8 !; 6 ?; 16 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(dtree_type,type,
dtree: $tType ).
thf(t_type,type,
t: $tType ).
thf(parall1899940088le_par_type,type,
parall1899940088le_par: ( product_prod @ dtree @ dtree ) > dtree ).
thf(product_Pair_type,type,
product_Pair:
!>[TA: $tType,TB: $tType] : ( TB > TA > ( product_prod @ TB @ TA ) ) ).
thf(tr1_type,type,
tr1: dtree ).
thf(tr2_type,type,
tr2: dtree ).
thf(trA_type,type,
trA: dtree ).
thf(174,axiom,
( trA
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr1 @ tr2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3__092_060open_062trA_H_A_061_Atr1_H_A_092_060parallel_062_Atr2_H_092_060close_062) ).
thf(771,plain,
( trA
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr1 @ tr2 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[174]) ).
thf(772,plain,
( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr1 @ tr2 ) )
= trA ),
inference(lifteq,[status(thm)],[771]) ).
thf(1,conjecture,
? [A: dtree,B: dtree] :
( ( trA
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ A @ B ) ) )
& ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr2 @ tr1 ) )
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ B @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_3) ).
thf(2,negated_conjecture,
~ ? [A: dtree,B: dtree] :
( ( trA
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ A @ B ) ) )
& ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr2 @ tr1 ) )
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ B @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(208,plain,
~ ? [A: dtree,B: dtree] :
( ( trA
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ A @ B ) ) )
& ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr2 @ tr1 ) )
= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ B @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(209,plain,
! [B: dtree,A: dtree] :
( ( trA
!= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ A @ B ) ) )
| ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr2 @ tr1 ) )
!= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ B @ A ) ) ) ),
inference(cnf,[status(esa)],[208]) ).
thf(210,plain,
! [B: dtree,A: dtree] :
( ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ A @ B ) )
!= trA )
| ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr2 @ tr1 ) )
!= ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ B @ A ) ) ) ),
inference(lifteq,[status(thm)],[209]) ).
thf(877,plain,
! [B: dtree,A: dtree] :
( ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ A @ B ) )
!= trA )
| ( ( product_Pair @ dtree @ dtree @ tr2 @ tr1 )
!= ( product_Pair @ dtree @ dtree @ B @ A ) ) ),
inference(simp,[status(thm)],[210]) ).
thf(878,plain,
! [B: dtree,A: dtree] :
( ( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ A @ B ) )
!= trA )
| ( tr2 != B )
| ( tr1 != A ) ),
inference(simp,[status(thm)],[877]) ).
thf(879,plain,
( ( parall1899940088le_par @ ( product_Pair @ dtree @ dtree @ tr1 @ tr2 ) )
!= trA ),
inference(simp,[status(thm)],[878]) ).
thf(1572,plain,
$false,
inference(simplifyReflect,[status(thm)],[772,879]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : COM206^1 : TPTP v8.1.2. Released v7.0.0.
% 0.09/0.12 % Command : run_Leo-III %s %d
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue May 7 00:54:08 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.86/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.81/1.13 % [INFO] Parsing done (303ms).
% 1.81/1.15 % [INFO] Running in sequential loop mode.
% 2.55/1.41 % [INFO] nitpick registered as external prover.
% 2.55/1.42 % [INFO] Scanning for conjecture ...
% 2.75/1.53 % [INFO] Found a conjecture and 283 axioms. Running axiom selection ...
% 3.10/1.65 % [INFO] Axiom selection finished. Selected 205 axioms (removed 78 axioms).
% 4.04/1.90 % [INFO] Problem is higher-order (TPTP THF).
% 4.04/1.92 % [INFO] Type checking passed.
% 4.04/1.93 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 7.99/3.01 % [INFO] [Domain constraints] Detected constraint on $o
% 7.99/3.01 % [INFO] [Domain constraints] dom($o) ⊆ {$true}
% 39.73/7.91 % [INFO] Killing All external provers ...
% 39.73/7.93 % Time passed: 7465ms (effective reasoning time: 6776ms)
% 39.73/7.93 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 39.73/7.93 % Axioms used in derivation (1): fact_3__092_060open_062trA_H_A_061_Atr1_H_A_092_060parallel_062_Atr2_H_092_060close_062
% 39.73/7.93 % No. of inferences in proof: 12
% 39.73/7.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 7465 ms resp. 6776 ms w/o parsing
% 39.73/7.99 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 39.73/7.99 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------